Commitment Games with Conditional Information Disclosure

The conditional commitment abilities of mutually transparent computer agents have been studied in previous work on games and program equilibrium. This literature has shown how these can help resolve Prisoner’s Dilemmas other failures cooperation complete information settings. But inefficiencies due to private neglected thus far this literature, despite the fact that problems are pervasive might also be addressed by greater mutual transparency. In work, we introduce a framework for with new kind device, which use conditionally disclose information. We prove folk theorem setting provides sufficient conditions ex post efficiency, represents model ideal between without third-party mediator. Further, extending equilibrium, develop an implementation disclosure. show forms ε-Bayesian Nash equilibria corresponding Bayesian games.